41![Combinators for Bi-Directional Tree Transformations: A Linguistic Approach to the View Update Problem J. Nathan Foster Michael B. Greenwald Combinators for Bi-Directional Tree Transformations: A Linguistic Approach to the View Update Problem J. Nathan Foster Michael B. Greenwald](https://www.pdfsearch.io/img/23e05138a430fb3a0d885d4614f0479b.jpg) | Add to Reading ListSource URL: www.cis.upenn.eduLanguage: English - Date: 2005-02-13 21:11:53
|
---|
42![Build-a-Tree: Parent-Child Gaming to Learn About Evolution in Museum Settings Krystal Villanosa - Northwestern University, Evanston, IL, USA Florian Block - Harvard University, Cambridge, MA, USA Michael Horn - Northwest Build-a-Tree: Parent-Child Gaming to Learn About Evolution in Museum Settings Krystal Villanosa - Northwestern University, Evanston, IL, USA Florian Block - Harvard University, Cambridge, MA, USA Michael Horn - Northwest](https://www.pdfsearch.io/img/813d73136b35da14aa7b0670ab4008a1.jpg) | Add to Reading ListSource URL: tidal.sesp.northwestern.eduLanguage: English - Date: 2015-02-21 00:47:12
|
---|
43![2014 IEEE Security and Privacy Workshops Understanding Insider Threat: A Framework for Characterising Attacks Jason R.C. Nurse† , Oliver Buckley† , Philip A. Legg† , Michael Goldsmith† , Sadie Creese† , Gordon 2014 IEEE Security and Privacy Workshops Understanding Insider Threat: A Framework for Characterising Attacks Jason R.C. Nurse† , Oliver Buckley† , Philip A. Legg† , Michael Goldsmith† , Sadie Creese† , Gordon](https://www.pdfsearch.io/img/6d9e4e08815ba7f7e8f73825ed875363.jpg) | Add to Reading ListSource URL: ieee-security.orgLanguage: English - Date: 2014-04-30 03:10:27
|
---|
44![1 Transductive Multi-Label Learning via Alpha Matting Xiang-Nan Kong, Michael K. Ng, and Zhi-Hua Zhou, Senior Member, IEEE 1 Transductive Multi-Label Learning via Alpha Matting Xiang-Nan Kong, Michael K. Ng, and Zhi-Hua Zhou, Senior Member, IEEE](https://www.pdfsearch.io/img/718e8b9f584c98016cb9d52c36f141c8.jpg) | Add to Reading ListSource URL: www.math.hkbu.edu.hkLanguage: English - Date: 2009-12-07 09:24:08
|
---|
45![Tree Automata over Infinite Alphabets Michael Kaminski and Tony Tan Department of Computer Science, Technion – Israel Institute of Technology, Haifa 32000, Israel {kaminski,tantony}@cs.technion.ac.il Dedicated to Bori Tree Automata over Infinite Alphabets Michael Kaminski and Tony Tan Department of Computer Science, Technion – Israel Institute of Technology, Haifa 32000, Israel {kaminski,tantony}@cs.technion.ac.il Dedicated to Bori](https://www.pdfsearch.io/img/085d5ee30acbfb1da81df67bc6db7511.jpg) | Add to Reading ListSource URL: alpha.uhasselt.beLanguage: English - Date: 2013-09-27 07:35:34
|
---|
46![Dynamic Graphs in the Sliding-Window Model? Michael S. Crouch, Andrew McGregor, and Daniel Stubbs University of Massachusetts Amherst 140 Governors Drive, Amherst, MA 01003 {mcc,mcgregor,dstubbs}@cs.umass.edu Dynamic Graphs in the Sliding-Window Model? Michael S. Crouch, Andrew McGregor, and Daniel Stubbs University of Massachusetts Amherst 140 Governors Drive, Amherst, MA 01003 {mcc,mcgregor,dstubbs}@cs.umass.edu](https://www.pdfsearch.io/img/02725041894e2d52ab83ff03f6954030.jpg) | Add to Reading ListSource URL: people.cs.umass.eduLanguage: English - Date: 2013-06-23 17:01:11
|
---|
47![GRADES GRADES Coast Redwoods ® GRADES GRADES Coast Redwoods ®](https://www.pdfsearch.io/img/7ca5817fab35a1c00e2f7a6010aafc82.jpg) | Add to Reading ListSource URL: education.savetheredwoods.orgLanguage: English - Date: 2011-02-17 15:00:43
|
---|
48![How Tall IS a Redwood? Many coast redwood trees are more than 320 feet tall! Have you ever wondered how big that REALLY is? It can be difficult for us to imagine. Get an idea by measuring your height and then calculating How Tall IS a Redwood? Many coast redwood trees are more than 320 feet tall! Have you ever wondered how big that REALLY is? It can be difficult for us to imagine. Get an idea by measuring your height and then calculating](https://www.pdfsearch.io/img/10a57bdfd604bf50e90aa9f03e74ed46.jpg) | Add to Reading ListSource URL: education.savetheredwoods.orgLanguage: English - Date: 2013-11-13 14:43:20
|
---|
49![High Performance Dynamic Lock-Free Hash Tables and List-Based Sets Maged M. Michael IBM Thomas J. Watson Research Center P.O. Box 218 Yorktown Heights NYUSA High Performance Dynamic Lock-Free Hash Tables and List-Based Sets Maged M. Michael IBM Thomas J. Watson Research Center P.O. Box 218 Yorktown Heights NYUSA](https://www.pdfsearch.io/img/b84d2c12edf45117b417eb6c69675418.jpg) | Add to Reading ListSource URL: www.research.ibm.comLanguage: English - Date: 2004-08-02 14:09:15
|
---|
50![Efficient Noise-Tolerant Learning from Statistical Queries MICHAEL KEARNS AT&T Laboratories—Research, Florham Park, New Jersey Abstract. In this paper, we study the problem of learning in the presence of classificatio Efficient Noise-Tolerant Learning from Statistical Queries MICHAEL KEARNS AT&T Laboratories—Research, Florham Park, New Jersey Abstract. In this paper, we study the problem of learning in the presence of classificatio](https://www.pdfsearch.io/img/59b69dd1a489b2fd2843473f2e8ef22b.jpg) | Add to Reading ListSource URL: www.cs.iastate.eduLanguage: English - Date: 2003-04-11 14:26:30
|
---|